منابع مشابه
Compressed Sensing and Dictionary Learning
Compressed sensing is a new field that arose as a response to inefficient traditional signal acquisition schemes. Under the assumption that the signal of interest is sparse, one wishes to take a small number of linear samples and later utilize a reconstruction algorithm to accurately recover the compressed signal. Typically, one assumes the signal is sparse itself or with respect to some fixed ...
متن کاملA Dictionary-Based Compressed Pattern Matching Algorithm
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompression. To utilize bandwidth more effectively in the Internet environment, it is highly desirable that data be kept and sent over the Internet in the compressed form. In order to support information retrieval for compressed ...
متن کاملPractical Entropy-Compressed Rank/Select Dictionary
Rank/Select dictionaries are data structures for an ordered set S f0; 1; : : : ; n 1g to compute rank(x; S) (the number of elements in S which are no greater than x), and select(i; S) (the i-th smallest element in S), which are the fundamental components of succinct data structures of strings, trees, graphs, etc. In those data structures, however, only asymptotic behavior has been considered an...
متن کاملDictionary Design for Compressed Sensing MRI
Introduction: The recently introduced Compressed Sensing (CS) theory promises to accelerate data acquisition in magnetic resonance imaging (MRI) [1-3]. One of the important requirements in CS MRI is that the image has a sparse representation. This sparse representation is crucial for successful recovery in CS. Generally speaking, sparser representations yield improved performance in terms of ei...
متن کاملSmall-Space 2D Compressed Dictionary Matching
The dictionary matching problem seeks all locations in a text that match any of the patterns in a dictionary. In the compressed dictionary matching problem, the input is in compressed form. In this paper we introduce the 2-dimensional compressed dictionary matching problem in Lempel-Ziv compressed images, and present an efficient solution for patterns whose rows are all periodic. Given k patter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Fourier Analysis and Applications
سال: 2020
ISSN: 1069-5869,1531-5851
DOI: 10.1007/s00041-020-09738-6